Pencarian Jalur Terpendek dengan Algoritma Dijkstra
نویسندگان
چکیده
منابع مشابه
Dijkstra Graphs
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquire a structure that is desirable in many aspects. While much has been written about structured programming, an important issue has been left unanswered: given an arbitrary, compiled program, describe an algorithm to de...
متن کاملFormalizing Dijkstra
We present a HOL formalization of the foundational parts of Dijkstra’s classic monograph “A Discipline of Programming”. While embedding programming language semantics in theorem provers is hardly new, this particular undertaking raises several interesting questions, and perhaps makes an interesting supplement to the monograph. Moreover, the failure of HOL’s first order proof tactic to prove one...
متن کاملThe Development of Semantic Web to Search Student Final Study Collections (Work Practice and Final Project)
1. H. F. Gunawan, “Penerapan Web Semantik Untuk Aplikasi Pencarian Pada Repositori Koleksi Penelitian ,Studi Kasus : Program Studi Sistem Informasi Stmik Mikroskil Medan,” vol. 15, no. 1, pp. 51–60, 2014. 2. I. A. S. Wicaksono, N. Charibaldi, and H. Jayadianti, “Penerapan Teknologi Semantic Web untuk Menentukan Pilihan Jalur Bis Trans Jogja,” Semin. Nas. Inform. 2010 (semnasIF 2010), vol. 2010,...
متن کاملCytotoxic effect of γ-sitosterol from Kejibeling (Strobilanthes crispus) and its mechanism of action towards c-myc gene expression and apoptotic pathway
Metode: Penelitian in vitro ini menggunakan kultur sel kanker kolon manusia (Caco-2), sel kanker hepar manusia (HepG2), sel kanker payudara tergantung hormon (MCF7) dan kultur sel normal hepar manusia (Chang Liver). Efek sitotoksik diukur melalui uji MTT melalui penentuan kadar yang membunuh 50% sel (IC50). Mekanisme sitotoksik dipelajari dengan menentukan pengaruh penambahan γ-sitosterol pada ...
متن کاملDijkstra Monads in Monadic Computation
The Dijkstra monad has been introduced recently for capturing weakest precondition computations within the context of program verification, supported by a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and pred...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SinkrOn
سال: 2017
ISSN: 2541-2019,2541-044X
DOI: 10.33395/sinkron.v2i2.61